Quantum codes over a class of finite chain ring
نویسندگان
چکیده
In this study, we introduce a new Gray map which preserves the orthogonality from the chain ring F2 [u] / (u) to F s 2 where F2 is the finite field with two elements. We also give a condition of the existence for cyclic codes of odd length containing its dual over the ring F2 [u] / (u) . By taking advantage of this Gray map and the structure of the ring, we obtain two classes of binary quantum error correcting (QEC) codes and we finally illustrate our results by presenting some examples with good parameters.
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملQuantum Codes from Linear Codes over Finite Chain Rings
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-ShorSteane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring Fp2m + uFp2m. The good parameter...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کامل2-D skew constacyclic codes over R[x, y; ρ, θ]
For a finite field $mathbb{F}_q$, the bivariate skew polynomial ring $mathbb{F}_q[x,y;rho,theta]$ has been used to study codes cite{XH}. In this paper, we give some characterizations of the ring $R[x,y;rho,theta]$, where $R$ is a commutative ring. We investigate 2-D skew $(lambda_1,lambda_2)$-constacyclic codes in the ring $R[x,y;rho,theta]/langle x^l-lambda_1,y^s-lambda_2rangle_{mathit{l}}.$ A...
متن کاملRepeated-root cyclic and negacyclic codes over a finite chain ring
We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality and Hamming distance of repeated-root c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information & Computation
دوره 16 شماره
صفحات -
تاریخ انتشار 2016